منابع مشابه
The existence totally reflexive covers
Let $R$ be a commutative Noetherian ring. We prove that over a local ring $R$ every finitely generated $R$-module $M$ of finite Gorenstein projective dimension has a Gorenstein projective cover$varphi:C rightarrow M$ such that $C$ is finitely generated and the projective dimension of $Kervarphi$ is finite and $varphi$ is surjective.
متن کاملNon-Abelian Sequenceable Groups Involving ?-Covers
A non-abelian finite group is called sequenceable if for some positive integer , is -generated ( ) and there exist integers such that every element of is a term of the -step generalized Fibonacci sequence , , , . A remarkable application of this definition may be find on the study of random covers in the cryptography. The 2-step generalized sequences for the dihedral groups studi...
متن کاملUnramified Covers of Galois Covers of Low Genus Curves
Let X → Y be a Galois covering of curves, where the genus of X is ≥ 2 and the genus of Y is ≤ 2. We prove that under certain hypotheses, X has an unramified cover that dominates a hyperelliptic curve; our results apply, for instance, to all tamely superelliptic curves. Combining this with a theorem of Bogomolov and Tschinkel shows that X has an unramified cover that dominates y = x − 1, if char...
متن کاملFlows, flow-pair covers and cycle double covers
In this paper, some earlier results by Fleischner [H. Fleischner, Bipartizing matchings and Sabidussi’s compatibility conjecture, DiscreteMath. 244 (2002) 77–82] about edge-disjoint bipartizingmatchings of a cubic graphwith a dominating circuit are generalized for graphs without the assumption of the existence of a dominating circuit and 3-regularity. A pair of integer flows (D, f1) and (D, f2)...
متن کاملVertex Covers and Connected Vertex Covers in 3-connected Graphs
A vertex cover of a graph G=(V,E) is a subset N of V such that each element of E is incident upon some element of N, where V and E are the sets of vertices and of edges of G, respectively. A connected vertex cover of a graph G is a vertex cover of G such that the subgraph G[N] induced by N of G is connected. The minimum vertex cover problem (VCP) is the problem of finding a vertex cover of mini...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of The American Mosquito Control Association
سال: 2023
ISSN: ['8756-971X', '1943-6270']
DOI: https://doi.org/10.2987/1943-6270-39.1.i